A Generalized Pseudo-SSO Scheme
نویسندگان
چکیده
منابع مشابه
Community-Unterstützung für Pseudo-SSO-Systeme
Für Benutzer ist es im Allgemeinen nicht möglich, für jeden Dienst ein unabhängiges, starkes Passwort zu wählen. Diese Situation legt es nahe, den Nutzern ein Single Sign-on (SSO) anzubieten, das es erlaubt, sich mit nur noch einem Passwort an mehreren Diensten anzumelden. Pseudo-SSO-Systeme müssen nicht vom Dienstanbieter unterstütz werden, und sind daher für den Nutzer sofort nützlich, bei ih...
متن کاملGeneralized pseudo-Riemannian geometry
Generalized tensor analysis in the sense of Colombeau’s construction is employed to introduce a nonlinear distributional pseudo-Riemannian geometry. In particular, after deriving several characterizations of invertibility in the algebra of generalized functions we define the notions of generalized pseudo-Riemannian metric, generalized connection and generalized curvature tensor. We prove a “Fun...
متن کاملA Generalized FAST TCP scheme
FAST TCP has been shown to be promising in terms of system stability, throughput and fairness. However, it requires buffering which increases linearly with the number of flows bottlenecked at a link. This paper proposes a new TCP algorithm that extends FAST TCP to achieve (α, n)-proportional fairness in steady state, yielding buffer requirements which grow only as the nth power of the number of...
متن کاملA New Simplified Swarm Optimization (sso) Using Exchange Local Search Scheme
Swarm-based optimization algorithms have demonstrated to have effective ability to solve the classification problem in multiclass databases. However, these algorithms tend to suffer from premature convergence in the high dimensional problem space. This paper proposes a novel simplified swarm optimization (SSO) algorithm to overcome the above convergence problem by incorporating it with the new ...
متن کاملGeneralized Lapped Pseudo Biorthogonal Transforms
We investigate a special class of N-channel oversampled linearphase perfect reconstruction filter banks with a smaller decimation factor M than N. We deal with systems in which all analysis and synthesis filters have the same FIR length and share the same center of symmetry. We provide the general lattice factorization of a polyphase matrix of a particular class of these oversampled filter bank...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Theory and Engineering
سال: 2011
ISSN: 1793-8201
DOI: 10.7763/ijcte.2011.v3.372